Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots

International audiencePredicting the folding of an RNA sequence, while allowing general pseudoknots (PK), consists in finding a minimal free-energy matching of its $n$ positions. Assuming independently contributing base-pairs, the problem can be solved in $\Theta(n^3)$-time using a variant of the maximal weighted matching. By contrast, the problem was previously proven NP-Hard in the more realistic nearest-neighbor energy model. In this work, we consider an intermediate model, called the stacking-pairs energy model. We extend a result by Lyngs\o, showing that RNA folding with PK is NP-Hard within a large class of parametrization for the model. We also show the approximability of the problem, by giving a practical $\Theta(n^3)$ algorithm that achieves at least a $5$-approximation for any parametrization of the stacking model. This contrasts nicely with the nearest-neighbor version of the problem, which we prove cannot be approximated within any positive ratio, unless $P=NP$.La prédiction du repliement, avec pseudonoeuds généraux, d'une séquence d'ARN de taille $n$ est équivalent à la recherche d'un couplage d'énergie libre minimale. Dans un modèle d'énergie simple, où chaque paire de base contribue indépendamment à l'énergie, ce problème peut être résolu en temps $\Theta(n^3)$ grâce à une variante d'un algorithme de couplage pondéré maximal. Cependant, le même problème a été démontré NP-difficile dans le modèle d'énergie dit des plus proches voisins. Dans ce travail, nous étudions les propriétés du problème sous un modèle d'empilements, constituant un modèle intermédiaire entre ceux d'appariement et des plus proches voisins. Nous démontrons tout d'abord que le repliement avec pseudo-noeuds de l'ARN reste NP-difficile dans de nombreuses valuations du modèle d'énergie. . Par ailleurs, nous montrons que ce problème est approximable, en proposant un algorithme polynomial garantissant une $1/5$-approximation. Ce résultat illustre une différence essentielle entre ce modèle et celui des plus proches voisins, pour lequel nous montrons qu'il ne peut être approché à aucun ratio positif par un algorithme en temps polynomial sauf si $N=NP$

Effects of rapid prey evolution on predator-prey cycles

We study the qualitative properties of population cycles in a predator-prey system where genetic variability allows contemporary rapid evolution of the prey. Previous numerical studies have found that prey evolution in response to changing predation risk can have major quantitative and qualitative effects on predator-prey cycles, including: (i) large increases in cycle period, (ii) changes in phase relations (so that predator and prey are cycling exactly out of phase, rather than the classical quarter-period phase lag), and (iii) "cryptic" cycles in which total prey density remains nearly constant while predator density and prey traits cycle. Here we focus on a chemostat model motivated by our experimental system [Fussmann et al. 2000,Yoshida et al. 2003] with algae (prey) and rotifers (predators), in which the prey exhibit rapid evolution in their level of defense against predation. We show that the effects of rapid prey evolution are robust and general, and furthermore that they occur in a specific but biologically relevant region of parameter space: when traits that greatly reduce predation risk are relatively cheap (in terms of reductions in other fitness components), when there is coexistence between the two prey types and the predator, and when the interaction between predators and undefended prey alone would produce cycles. Because defense has been shown to be inexpensive, even cost-free, in a number of systems [Andersson and Levin 1999, Gagneux et al. 2006,Yoshida et al. 2004], our discoveries may well be reproduced in other model systems, and in nature. Finally, some of our key results are extended to a general model in which functional forms for the predation rate and prey birth rate are not specified.Comment: 35 pages, 8 figure

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components

The NP-hard Colorful Components problem is a graph partitioning problem on vertex-colored graphs. We identify a new ap-plication of Colorful Components in the correction of Wikipedia interlanguage links, and describe and compare three exact and two heuristic approaches. In particular, we devise two ILP formulations, one based on Hitting Set and one based on Clique Partition. Furthermore, we use the recently proposed implicit hitting set framework [Karp, JCSS 2011, Chandrasekaran et al., SODA 2011] to solve Colorful Components. Finally, we study a move-based and a merge-based heuristic for Col-orful Components. We can optimally solve Colorful Components for Wikipedia link correction data; while the Clique Partition-based ILP outperforms the other two exact approaches, the implicit hitting set is a simple and competitive alternative. The merge-based heuristic is very accurate and outperforms the move-based one. The above results for Wikipedia data are confirmed by experiments with synthetic instances